#include <bits/stdc++.h>
using namespace std;
int n, r[100005], ans, i;
priority_queue<int> q;
int main()
{
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin >> n;
    for(int i = 1; i <= n; ++i)
    {
        cin >> r[i];
    }
    sort(r+1, r+n+1);
    for(int i = 1; i <= n; ++i)
    {
        q.push(-r[i]);
        if(q.top() > -r[i])
            q.pop();
    }
    cout << q.size();
    return 0;
}